/**
*      author: Y_Yao
*      created: 2024-11-27 11:39:53
**/

#include<bits/stdc++.h>

using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int dp[N];
int n;
int a[N];

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    int ans = -INF;
    for(int i = 1;i <= n;i++)
    {
        dp[i] = max(dp[i-1] + a[i],a[i]);
        ans = max(ans,dp[i]);
    }

    cout << ans << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}